#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
vector<LL>g[maxn];
vector<LL>ans;
bool vis[maxn];
void dfs(LL u,LL fa){
     vis[u]=true;
     ans.push_back(u);
     for(auto i:g[u]){
        if(vis[i]) continue;
        //ans.push_back(i);
        dfs(i,u);
     }
     ans.push_back(fa);
}
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL n;cin>>n;
    for(LL i=1;i<n;i++){
        LL a,b;cin>>a>>b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    for(LL i=1;i<=n;i++) sort(g[i].begin(),g[i].end());
    dfs(1,0);
    for(auto i:ans){
        if(i==0) continue;
        cout<<i<<" ";
    }cout<<"\n";
   	return 0;
}
